منابع مشابه
Unsplittable Flows
An unsplittable flow in a multicommodity network is a flow that routes each commoidty on a single path. In this paper, we introduce the unsplittable flow problem and an open conjecture of Goemans, which states that given a fractional flow it is possible to construct an unsplittable flow that only overflows each edge by at most the maximum demand of a commodity. We provide an intuitive explanati...
متن کاملSelfish Unsplittable Flows
What is the price of anarchy when unsplittable demands are routed selfishly in general networks with load-dependent edge delays? Motivated by this question we generalize the model of [14] to the case of weighted congestion games. We show that varying demands of users crucially affect the nature of these games, which are no longer isomorphic to exact potential games, even for very simple instanc...
متن کاملAn IntroductIon to trIAngulAtIon
FORWARD Dear Colleagues, I would like to welcome you to the UNAIDS Monitoring and Evaluation Fundamentals series. As the response to the global HIV epidemic continues to evolve, monitoring and evaluation (M&E) has become more important than ever. Determining what programs do or do not work; implementing programs with proven cost-effectiveness; monitoring progress towards achieving targets; and ...
متن کاملSingle-Source Unsplittable Flow
The max-ow min-cut theorem of Ford and Fulkerson is based on an even more foundational result, namely Menger's theorem on graph connectivity. Menger's theorem provides a good characterization for the following single{source disjoint paths problem: given a graph G, with a source vertex s and terminals t 1 ; : : :; t k , decide whether there exist edge{disjoint s-t i paths, for i = 1; : : :; k. W...
متن کاملThe Jal triangulation: An adaptive triangulation in any dimension
Spatial sampling methods have acquired great popularity due to the number of applications that need to triangulate portions of space in various dimensions. One limitation of the current techniques is the handling of the final models, which are large, complex and need to register neighborhood relationships explicitly. Additionally, most techniques are limited to Euclidean bidimensional or tridim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1971
ISSN: 0026-2285
DOI: 10.1307/mmj/1029000678